Time vs. Space in Fault-Tolerant Distributed Systems
نویسندگان
چکیده
Algorithms for solving agreement problems can be classified in two categories: (1) those relying on failure detectors that we call FD-based, and (2) those that rely on a Group Membership Service that we call GMS-based. The paper discusses the advantages and limitations of these two approaches, and proposes an extension to the GMS-approach that combines the advantages of both approaches, without their drawbacks. This extension leads us to distinguish between timetriggered suspicions of processes and space-triggered
منابع مشابه
Automated Synthesis of Timed and Distributed Fault-Tolerant Systems
This dissertation concentrates on the problem of automated synthesis and repair of fault-tolerant systems. In particular, given the required specification of the system, our goal is to synthesize a fault-tolerant system, or repair an existing one. We study this problem for two classes of timed and distributed systems. In the context of timed systems, we focus on efficient synthesis of fault-tol...
متن کاملFault-tolerant Reconnguration of Trees and Rings in Distributed Systems
We design two programs that maintain the nodes of any distributed system in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any nite number of fail-stop failures and repairs of system nodes and communication channels. Our programs are fully distributed, have optimal time and space complexity, and illustrate two diierent methods for the design of nonmasking ...
متن کاملA Space-Optimal Self-Stabilizing Algorithm for the Maximal Independent Set Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of time complexity is (n+ 2)(n+ 1)/4 steps, w...
متن کاملA Fault-tolerant distributed data flow architecture for real-time decentralized control
Complex control-oriented structures are inherently multiple input, multiple output systems whose complexities increase significantly with each additional parameter. When precision performance in both space and time is required, these types of applications can be described as real-time systems that demand substantial amounts of computational power in order to function properly. The failure of a ...
متن کاملReal-time Fault-tolerant Scheduling in Heterogeneous Distributed Systems
∗ This work was supported by National Defense Pre-research Foundation of China. Abstract: Some works have been done in addressing real-time fault-tolerant scheduling algorithms. However, they all based on homogeneous distributed systems or multiprocessor systems, which have identical processors. This paper presents two fault-tolerant scheduling algorithms, RTFTNO and RTFTRC, for periodic real-t...
متن کامل